Expansion Coding for Channel and Source Coding
نویسندگان
چکیده
A general method of coding over expansion is proposed, which allows one to reduce the highly non-trivial problems of coding over analog channels and compressing analog sources to a set of much simpler subproblems, coding over discrete channels and compressing discrete sources. More specifically, the focus of this paper is on the additive exponential noise (AEN) channel, and lossy compression of exponential sources. Taking advantage of the essential decomposable property of these channels (sources), the proposed expansion method allows for mapping of these problems to coding over parallel channels (respectively, sources), where each level is modeled as an independent coding problem over discrete alphabets. Any feasible solution to the resulting optimization problem after expansion corresponds to an achievable scheme of the original problem. Utilizing this mapping, even for the cases where the optimal solutions are difficult to characterize, it is shown that the expansion coding scheme still performs well with appropriate choices of parameters. More specifically, theoretical analysis and numerical results reveal that expansion coding achieves the capacity of AEN channel in the high SNR regime. It is also shown that for lossy compression, the achievable rate distortion pair by expansion coding approaches to the Shannon limit in the low distortion region. Remarkably, by using capacityachieving codes with low encoding and decoding complexity that are originally designed for discrete The material in this paper was presented in part at the 2012 IEEE International Symposium on Information Theory, Boston, MA, Jul. 2012, and in part at the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, Jul. 2014. H. Si and S. Vishwanath are with the Laboratory for Informatics, Networks, and Communications, Wireless Networking and Communications Group, The University of Texas at Austin, Austin, TX 78712. Email: [email protected], [email protected]. O. O. Koyluoglu is with the Department of Electrical and Computer Engineering, The University of Arizona, Tucson, AZ 85721. Email: [email protected]. K. Appaiah is with the Department of Electrical Engineering, Indian Institute of Technology Bombay. Email: [email protected]. ar X iv :1 50 5. 05 48 1v 1 [ cs .I T ] 2 0 M ay 2 01 5
منابع مشابه
Achievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel
In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملSource - Channel Mappings with Applications to Compressed Sensing
Tandem source-channel coding is proven to be optimal by Shannon given unlimited delay and complexity in the coders. Under low delay and low complexity constraints, joint source-channel coding may achieve better performance. Although digital joint source-channel coding has shown a noticeable gain in terms of reconstructed signal quality, coding delay, and complexity, it suffers from the leveling...
متن کاملSource-Channel Coding in Networks
The aim of source coding is to represent information as accurately as possible using as few bits as possible and in order to do so redundancy from the source needs to be removed. The aim of channel coding is in some sense the contrary, namely to introduce redundancy that can be exploited to protect the information when being transmitted over a nonideal channel. Combining these two techniques le...
متن کاملA Review of Joint Source-Channel Coding
This article presents methods for robust and efficient communication over wireless channels. Both benefits and limitations of the classical approach of separate source and channel coding are discussed. Joint source-channel coding (JSCC) is presented as the most promising scheme for communication of analogue sources over wireless channels, due to its ability to cope with varying channel qualitie...
متن کاملBounds for Multiple-Access Relay Channels with Feedback via Two-way Relay Channel
In this study, we introduce a new two-way relay channel and obtain an inner bound and an outer bound for the discrete and memoryless multiple access relay channels with receiver-source feedback via two-way relay channel in which end nodes exchange signals by a relay node. And we extend these results to the Gaussian case. By numerical computing, we show that our inner bound is the same with o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1505.05481 شماره
صفحات -
تاریخ انتشار 2015